منابع مشابه
Rewriting Modulo in Deduction Modulo
We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In a previous work, we defined general syntactic conditions based on the notion of computable closure for ensuring the termination of the combination of rewriting and beta-re...
متن کاملBiprojectivty of Banach algebras modulo an ideal
In this paper, we introduce the new concept of biprojectivity of a Banach algebra modulo an ideal, as a generalization of this notion in the classical case. By using it , we obtain some necessary and sufficient conditions for contractibility of Banach algebras modulo an ideal. In particular we characterize the contractibility of quotient Banach algebras. Also we study the relationship between t...
متن کاملNonstationary Search
This paper explores equilibrium and optimal matching behavior in constant returns to scale search economies with heterogeneous agents. We show that optimal matching behavior may involve a nontrivial limit cycle, and that there may exist a continuum of cyclical perfect foresight equilibria. These results hold for a generic set of parameter values. They are due to a trading externality (Diamond 1...
متن کاملZenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo
We propose an extension of the tableau-based first order automated theorem prover Zenon to deduction modulo. The theory of deduction modulo is an extension of predicate calculus, which allows us to rewrite terms as well as propositions, and which is well suited for proof search in axiomatic theories, as it turns axioms into rewrite rules. We also present a heuristic to perform this latter step ...
متن کاملRewriting Modulo \beta in the \lambda\Pi-Calculus Modulo
The λ Π-calculus Modulo is a variant of the λ -calculus with dependent types where β -conversion is extended with user-defined rewrite rules. It is an expressive logical framework and has been used to encode logics and type systems in a shallow way. Basic properties such as subject reduction or uniqueness of types do not hold in general in the λ Π-calculus Modulo. However, they hold if the rewr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monatshefte für Mathematik
سال: 2020
ISSN: 0026-9255,1436-5081
DOI: 10.1007/s00605-020-01431-6